The Wiener, Szeged and Pi-indices of a Phenylazomethine Dendrimer

نویسندگان

  • M. GOLRIZ
  • M. R. DARAFSHEH
  • M. H. KHALIFEH
  • Osamu Enoki
چکیده

Let G be a simple graph with vertex set and edge set . The function which assigns to each pair of vertices in , the length of minimal path from to , is called the distance function between two vertices. The distance function between and edge and a vertex is where for and. , . The Wiener index of a graph is denoted by and is defined by .In general this kind of index is called a topological index, which is a distance based quantity assigned to a graph. This is an invariant of the graph in the sense that if a graph H is isomorphic to then . The Wiener index for the first time was introduced by H. Wiener in [11] and is related to chemical substances. The definition of the Wiener index in terms of distance between vertices of a graph for the first time was given by Hosoya in [6]. This index is extensively studied by various authors, and we may refer the reader to [5] and [1] in which a new method is found to calculate the Wiener index of a graph. Another index that will be investigated in this paper is the Szeged index, which is defined as follows:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Topological Indices of some Dendrimer Graphs

In this paper the Wiener and hyper Wiener index of two kinds of dendrimer graphs are determined. Using the Wiener index formula, the Szeged, Schultz, PI and Gutman indices of these graphs are also determined.

متن کامل

Automatic graph construction of periodic open tubulene ((5,6,7)3) and computation of its Wiener, PI, and Szeged indices

The mathematical properties of nano molecules are an interesting branch of nanoscience for researches nowadays. The periodic open single wall tubulene is one of the nano molecules which is built up from two caps and a distancing nanotube/neck. We discuss how to automatically construct the graph of this molecule and plot the graph by spring layout algorithm in graphviz and netwrokx packages. The...

متن کامل

Wiener, Szeged and vertex PI indices of regular tessellations

A lot of research and various techniques have been devoted for finding the topological descriptor Wiener index, but most of them deal with only particular cases. There exist three regular plane tessellations, composed of the same kind of regular polygons namely triangular, square, and hexagonal. Using edge congestion-sum problem, we devise a method to compute the Wiener index and demonstrate th...

متن کامل

The Wiener, Szeged, and PI Indices of a Dendrimer Nanosta

Let G= V E be a simple connected graph. The distance between two vertices of G is defined to be the length of the shortest path between the two vertices. There are topological indices assigned to G and based on the distance function which are invariant under the action of the automorphism group of G. Some important indices assigned to G are the Wiener, Szeged, and PI index which we will find th...

متن کامل

Computing Vertex PI Index of Tetrathiafulvalene Dendrimers

General formulas are obtained for the vertex Padmakar-Ivan index (PIv) of tetrathiafulvalene (TTF) dendrimer, whereby TTF units we are employed as branching centers. The PIv index is a Wiener-Szeged-like index developed very recently. This topological index is defined as the summation of all sums of nu(e) and nv(e), over all edges of connected graph G.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011